Optimality properties of an Augmented Lagrangian method on infeasible problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality properties of an Augmented Lagrangian method

Sometimes, the feasible set of an optimization problem that one aims to solve using a Nonlinear Programming algorithm is empty. In this case, two characteristics of the algorithm are desirable. On the one hand, the algorithm should converge to a minimizer of some infeasibility measure. On the other hand, one may wish to find a point with minimal infeasibility for which some optimality condition...

متن کامل

An augmented Lagrangian optimization method for inflatable structures analysis problems

1. Abstract This paper describes the development of an augmented Lagrangian optimization method for the numerical simulation of the inflation process in the design of inflated space structures. Although the Newton-Raphson scheme has proved to be efficient for solving many non linear problems, it can lead to lacks of convergence when it is applied to the simulation of the inflation process. As a...

متن کامل

An Augmented Lagrangian Method for Optimization Problems in Banach Spaces

We propose a variant of the classical augmented Lagrangian method for constrained optimization problems in Banach spaces. Our theoretical framework does not require any convexity or second-order assumptions and allows the treatment of inequality constraints with infinite-dimensional image space. Moreover, we discuss the convergence properties of our algorithm with regard to feasibility, global ...

متن کامل

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method

In this work we are interested in nonlinear symmetric cone problems (NSCPs), which contain as special cases nonlinear semidefinite programming, nonlinear second order cone programming and the classical nonlinear programming problems. We explore the possibility of reformulating NSCPs as common nonlinear programs (NLPs), with the aid of squared slack variables. Through this connection, we show ho...

متن کامل

On an augmented Lagrangian-based preconditioning of Oseen type problems

The paper deals with a general framework for constructing preconditioners for saddle point matrices, in particular as arising in the discrete linearized Navier-Stokes equations (Oseen’s problem). We utilize the so-called augmented Lagrangian approach, where the original linear system of equations is first transformed to an equivalent one, which latter is then solved by a preconditioned iterativ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2014

ISSN: 0926-6003,1573-2894

DOI: 10.1007/s10589-014-9685-5